Bounds for Optimal Coverings

نویسندگان

  • Carlos Gustavo T. de A. Moreira
  • Yoshiharu Kohayakawa
چکیده

We give bounds for optimal coverings of finite sets by elements of regular families of subsets, and show that both upper and lower bounds are asymptotically sharp for some families of examples.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Improved Coverings of a Square with Six and Eight Equal Circles

In a recent article 19], Tarnai and GG aspp ar used computer simulations to nd thin coverings of a square with up to ten equal circles. We will give improved coverings with six and eight circles and a new, thin covering with eleven circles, found by the use of simulated annealing. Furthermore, we present a combinatorial method for constructing lower bounds for the optimal covering radius.

متن کامل

Coverings, matchings and paired domination in fuzzy graphs using strong arcs

The concepts of covering and matching in fuzzy graphs using strong arcs are introduced and obtained the relationship between them analogous to Gallai’s results in graphs. The notion of paired domination in fuzzy graphs using strong arcs is also studied. The strong paired domination number γspr of complete fuzzy graph and complete bipartite fuzzy graph is determined and obtained bounds for the s...

متن کامل

Further results on multiple coverings of the farthest-off points

Multiple coverings of the farthest-off points ((R,μ)-MCF codes) and the corresponding (ρ, μ)-saturating sets in projective spaces PG(N, q) are considered. We propose some methods which allow us to obtain new small (1, μ)-saturating sets and short (2, μ)-MCF codes with μ-density either equal to 1 (optimal saturating sets and almost perfect MCF-codes) or close to 1 (roughly 1+1/cq, c ≥ 1). In par...

متن کامل

On the Thinnest Coverings of Spheres and Ellipsoids with Balls in on the Thinnest Coverings of Spheres and Ellipsoids

In this paper, we present some new results on the thinnest coverings that can be obtained in Hamming or Euclidean spaces if spheres and ellipsoids are covered with balls of some radius ε. In particular, we tighten the bounds currently known for the ε-entropy of Hamming spheres of an arbitrary radius r. New bounds for the ε-entropy of Hamming balls are also derived. If both parameters ε and r ar...

متن کامل

Optimal convex combinations bounds of centrodial and harmonic means for logarithmic and identric means

We find the greatest values $alpha_{1} $ and $alpha_{2} $, and the least values $beta_{1} $ and $beta_{2} $ such that the inequalities $alpha_{1} C(a,b)+(1-alpha_{1} )H(a,b)

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Electronic Notes in Discrete Mathematics

دوره 7  شماره 

صفحات  -

تاریخ انتشار 2001